Nonterminal Complexity of Some Operations on Context-Free Languages
نویسندگان
چکیده
We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate the language. Especially, we consider the behaviour of this measure with respect to operations. For given numbers c1, c2, . . . , cn and an nary operation τ on languages we discuss the range of Var(τ(L1, L2, . . . , Ln)) where, for 1 ≤ i ≤ n, Li is a context-free language with Var(Li) = ci. The operation under discussion are the six AFL-operations union, concatenation, Kleene-closure, homomorphisms, inverse homomorphisms and intersections by regular sets.
منابع مشابه
Context-Free Grammars with Storage
Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an object of type S is associated, that can be acted upon by tests and operations, as indicated in the rules of the grammar. Taking particular storage types give...
متن کاملOn Descriptional Complexity of Partially Parallel Grammars
This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a four-nonterminal scattered context grammar with no more than four non-context-free productions, (ii) by a two-nonterminal multisequential grammar with no more than two selectors, or (iii) by a three-...
متن کاملA Note on Context-free Grammars with Rewriting Restrictions∗
In this work two special types of random context grammars are investigated. In one of these grammars one can apply a context-free rule to a nonterminal A only if the current sentential form does not contain a particular nonterminal associated toA. The other grammar works in the opposite direction, it requires the presence of the associated nonterminal to apply the rule. Here we show that these ...
متن کاملLanguage Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity
A tree controlled grammar is specified as a pair (G,G) where G is a context-free grammar and G is a regular grammar. Its language consists of all terminal words with a derivation in G such that all levels of the corresponding derivation tree – except the last level – belong to L(G). We define the nonterminal complexity Var(H) of H = (G,G) as the sum of the numbers of nonterminals of G and G. In...
متن کاملConstructive Learning of Context-Free Languages with a Subpansive Tree
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and investigate query learning of CFGs with the help of subpansive trees. We show a restricted class of CFGs, which we call hierarchical CFGs, is efficiently learnable, while it is unlikely to be polynomial-time predictable.
متن کامل